Implementing 3d Network Analysis in 3d-gis

Way finding or routing has been always used by common people in navigating from one place (of origin) to another (destination). And most of them are in two dimensional routing or network. In orthogonal concept, two-dimensional (2D) or three-dimensional (3D) routing uses planar or non-planar graph and spatial extend, where the third dimension is used to calculate the weights for the edges in the graph. Usually routing is done in a planar graph embedded in 2D space. Sometimes it is extended to non-planar graphs to model bridges, etc. but still embedded in 2D space. Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in time-critical applications such as emergency response applications. It doesn’t take into account dynamic emergency information changes at node/vertex level especially when applying in emergency situations such as large fires (in cities or even in buildings), floods, chemical releases, terrorist attacks, road accidents, etc. This study is based on finding shortest path route in a dynamic situation for indoors and outdoors using Single Sink Shortest Path (SSSP) routing algorithm. The main focus of the research is to implement 3D shortest path analysis in 3D data set. A program is developed to calculate the shortest path in 3D data set with the support of dynamic events that might or will occur at each of calculated routes.